GD-Workbench: A System for Prototyping and Testing Graph Drawing Algorithms
نویسندگان
چکیده
i Dipartimento di Informatica e Sistemistica, Universit~ di Roma "La Sapienza" Via Salaria 113, 00198 Roma, Italy {but i, t as s inar, vargiu} @dis. uniroma I. it 2 Dipartimento di Discipline Scientifiche, Sezione Informatica Terza Universith. di Roma Via Segre 2, 00146 Roma, Italy dibatt ista@ias i. rm. cnr. it 3 Department of Computer Science, Brown University 115 Waterman Street, Providence, Rhode Island 02912-1910 gl@cs, brown, edu 4 Istituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle Ricerche Viale Manzoni 30, 00185 Roma, Italy vismara@ias i. rm. car . it
منابع مشابه
The Graphlet System ( System Demonstration )
Graphlet is a portable, object oriented toolkit for graph editors and graph drawing algorithms, and is the successor of the GraphEd system. Graphlet is based on LEDA and Tcl/Tk. Algorithms can be implemented in C++ and LedaScript, a new scripting language based on Tcl/Tk. The GML format is a portable le format for graphs. The implementation and visualization of graph algorithms is an important ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملGRIP: Graph Drawing with Intelligent Placement
This paper describes a system for Graph dRawing with Intelligent Placement, GRIP. The system is designed for drawing large graphs and uses a novel multi-dimensional force-directed method together with fast energy function minimization. The algorithm underlying the system employs a simple recursive coarsening scheme. Rather than being placed at random, vertices are placed intelligently, several ...
متن کاملAutomated CAD conversion with the Machine Drawing Understanding System: concepts, algorithms, and performance
The Machine Drawing Understanding System (MDUS) is an experimental CAD conversion system aimed at realizing the entire process of understanding mechanical engineering drawings, from scanning to three-dimensional (3-D) reconstruction. This paper describes the structure, algorithms and current performance of MDUS. The modular structure of the system provides for further improvements and makes it ...
متن کاملA New Method for Characterization of Biological Particles in Microscopic Videos: Hypothesis Testing Based on a Combination of Stochastic Modeling and Graph Theory
Introduction Studying motility of biological objects is an important parameter in many biomedical processes. Therefore, automated analyzing methods via microscopic videos are becoming an important step in recent researches. Materials and Methods In the proposed method of this article, a hypothesis testing function is defined to separate biological particles from artifact and noise in captured v...
متن کامل